Decoding method for generalized algebraic geometry codes
نویسندگان
چکیده
We propose a decoding method for the generalized algebraic geometry codes proposed by Xing et al. To show its practical usefulness, we give an example of generalized algebraic geometry codes of length 567 over F8 whose numbers of correctable errors by the proposed method are larger than the shortened codes of the primitive BCH codes of length 4095 in the most range of dimension.
منابع مشابه
On GAG-Codes and Geometric Goppa Codes
We investigate a relation between generalized algebraic geometry codes and geometric Goppa codes. We also propose a decoding method for algebraic geometry codes.
متن کاملA class of Sudan-decodable codes
In this correspondence, Sudan’s algorithm is modified into an efficient method to list-decode a class of codes which can be seen as a generalization of Reed–Solomon codes. The algorithm is specialized into a very efficient method for unique decoding. The code construction can be generalized based on algebraic-geometry codes and the decoding algorithms are generalized accordingly. Comparisons wi...
متن کاملDecoding Algebraic Geometry codes by a key equation
A new effective decoding algorithm is presented for arbitrary algebraicgeometric codes on the basis of solving a generalized key equation with the majority coset scheme of Duursma. It is an improvement of Ehrhard’s algorithm, since the method corrects up to the half of the Goppa distance with complexity order O(n), and with no further assumption on the degree of the divisor G.
متن کاملConstruction and decoding of a class of algebraic geometry codes
Absfruct We construct a class of codes derived from algebraic plane curves. The concepts and results from algebraic geometry we use are explained in detail, and no further knowledge of algebraic geometry is needed. Parameters, generator and parity-check matrices are given. The main result is a decoding algorithm which turns out to be a generalization of the Peterson algorithm for decoding BCH c...
متن کاملGeneralized Berlekamp-Massey decoding of algebraic-geometric codes up to half the Feng-Rao bound
E FFICIENT decoding of BCHand Reed-Solomon codes can be done by using the Berlekamp-Massey algorithm [ 11, and it is natural to try to use the extension to N dimensions of Sakata [2] to decode algebraic-geometric codes. For codes from regular plane curves this was done in [3] and using the Feng-Rao majority scheme from [4], the procedure was extended in [S] and [6]. For a class of space curves ...
متن کامل